IMPROVED ANTLION OPTIMIZATION ALGORITHM FOR QUADRATIC ASSIGNMENT PROBLEM
نویسندگان
چکیده
The Antlion Optimization (ALO) algorithm is a meta-heuristic optimization based on the hunting of ants by antlions. basic inadequacy this that it has long run time because random walk model used for ant's movement. We improved some mechanisms in ALO algorithm, such as ants' walking, reproduction, sliding towards antlion, elitism, and selection procedure. This proposed called Improved (IALO) algorithm. To show performance IALO we different measurement metrics, mean best, standard deviation, optimality, accuracy, CPU time, number function evaluations (NFE). was tested benchmark test functions taken from literature. There are no studies regarding analysis found study firstly aims to demonstrate success especially runtime analysis. Secondly, also applied Quadratic Assignment Problem (QAP) known difficult combinatorial problem. In QAP tests, compared with performances classic 14 well-known recent algorithms. results able provide very competitive terms best/standard NFE metrics. prove faster than As result best according cost, worst cost deviation. source codes publicly available at https://github.com/uguryuzgec/QAP-with-IALO.
منابع مشابه
solving quadratic assignment problem (qap) using invasive weed optimization algorithm
a new powerful optimization algorithm inspired from colonizing weeds is utilized to solve the well-known quadratic assignment problem (qap) which is of application in a large number of practical areas such as plant layout, machinery layout and so on. a set of reference numerical problems from qaplib is taken in order to evaluate the efficiency of the algorithm compared with the previous ones wh...
متن کاملAn Improved Algorithm for the Generalized Quadratic Assignment Problem
This paper is concerned with solving GQAPs (generalized quadratic assignment problems) to optimality. In these problems, given M facilities and N locations, the facility space requirements, the location available space, the facility installation costs, the flows between facilities, and the distance costs between locations, one must assign each facility to exactly one location so that each locat...
متن کاملA Honey Bee Algorithm To Solve Quadratic Assignment Problem
Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...
متن کاملAnt Colony Optimization for Quadratic Assignment Problem
THE quadratic assignement problem (QAP) can be described as an optimizing the assignment a set of facilities to a set of locations with given costs between the locations and given flows between the facilities in order to minimize the sum of the product between flows and distances. A concrete example, would be a hospital planning optimization the location of various medical facilities in order t...
متن کاملa honey bee algorithm to solve quadratic assignment problem
assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. in this study, we solve quadratic assignment problem (qap), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. it should be noted that any facility must be assign to only one location. in this paper, first o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Malaysian Journal of Computer Science
سال: 2021
ISSN: ['0127-9084']
DOI: https://doi.org/10.22452/mjcs.vol34no1.3